Deadline-Aware Programming and Scheduling
نویسندگان
چکیده
Deadlines are the most important events in real-time systems. Realtime programs must therefore be aware of deadlines, and be able to identify and react to missed deadlines. Moreover, Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In this paper we explore how a resource sharing protocol (called the DFP – Deadline Floor inheritance Protocol), which has been proposed for languages such as Ada, can be incorporated into the language’s definition. We also address the programming of systems that have mixed scheduling (e.g. fixed priority and EDF). The incorporation of the DFP into Ada requires some changes to the current predefined packages. These changes are also of use in supporting the programming of deadline-aware systems even when not scheduling by EDF.
منابع مشابه
Deadline Aware Scheduling for Input Queued Packet Switches
We study the problem of designing scheduling algorithms for deadline-aware input-queued (IQ) packet switches. While most research on scheduling algorithms for IQ switches has focused on maximizing throughput, packet deadlines are a key consideration in the context of real-time applications like multimedia streaming and video telephony. We consider traffic streams associated with service profile...
متن کاملChannel, deadline, and distortion (CD2) aware scheduling for video streams over wireless
We study scheduling of multimedia traffic on the downlink of a wireless communication system. We examine a scenario where multimedia packets are associated with strict deadlines and are equivalent to lost packets if they arrive after their associated deadlines. Lost packets result in degradation of playout quality at the receiver, which is quantified in terms of the “distortion cost” associated...
متن کاملChannel, Deadline, and Distortion (CD) Aware Scheduling for Video Streams Over Wireless
We study scheduling of multimedia traffic on the downlink of a wireless communication system. We examine a scenario where multimedia packets are associated with strict deadlines and are equivalent to lost packets if they arrive after their associated deadlines. Lost packets result in degradation of playout quality at the receiver, which is quantified in terms of the “distortion cost” associated...
متن کاملReal-Time Task Scheduling for Energy-Aware Embedded Systems
We present a new approach for scheduling workloads containing periodic tasks in real-time systems. The proposed approach minimizes the total energy consumed by the task set and guarantees that the deadline for every periodic task is met. As embedded software becomes a larger component of system-on-a-chip design, energy management using the operating system becomes increasingly important. We pre...
متن کاملLink Aware Earliest Deadline Scheduling Algorithm for WiMAX
Allocating slots dynamically to the service flows in heterogeneous wireless network is highly complex and non-linear. Since the link quality is continuously changing, a wireless network employing adaptive modulation like WiMAX, allocating slot in such network is based on the link quality. In this paper, we present link aware packet scheduling algorithm using packet’s earliest deadline and buffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014